/*
 * Copyright 2010-2012 Susanta Tewari. <freecode4susant@users.sourceforge.net>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

/**
 * Backward recursion and computations (exact) based on it. The following acronyms are used: <ul>
 * <li>BR = Backward Recursion</li> <li>BRS = Backward Recursion Statistic</li> <li>BRW = Backward
 * Recursion Walker</li> </ul>
 * <p/>
 *
 * BRWalker creates the recursion graph that is visited by the implementations of BRWComp. The
 * required information for the computation is provided through BRWCompInfo by BRWalker.<p/>
 *
 * The collaborating classes in this package together implement the visitor pattern using the
 * observer pattern. BRWalker is the client, the recursion graph is the object structure, BRWComp is
 * the visitor interface. The required information for the visitor computation is encapsulated in
 * BRWCompInfo and passed around during the traversal using observer pattern. In the observer
 * pattern, BRWalker is the source and the visitors being the observers.
 */
package coalescent.br;
